Theorem Proving with Sequence Variables and Flexible Arity Symbols
نویسنده
چکیده
An ordering for terms with sequence variables and flexible arity symbols is presented. The ordering coincides with the lexicographic extension of multiset path ordering on terms without sequence variables. It is shown that the classical strict superposition calculus with ordering and equality constraints can be used as a refutationally complete proving method for well-constrained sets of clauses with sequence variables and flexible arity symbols.
منابع مشابه
Pattern Unification with Sequence Variables and Flexible Arity Symbols
A unification procedure for a theory with individual and sequence variables, free constants, free fixed and flexible arity function symbols and patterns is described. The procedure enumerates a set of substitution/constraint pairs which constitutes the minimal complete set of unifiers.
متن کاملUnification with Sequence Variables and Flexible Arity Symbols and Its Extension with Pattern-Terms
A minimal and complete unification procedure for a theory with individual and sequence variables, free constants and free fixed and flexible arity function symbols is described and a brief overview of an extension with pattern-terms is given.
متن کاملPattern Unification with Sequence Variables, Flexible Arity Symbols
A unification procedure for a theory with individual and sequence variables, free constants, free fixed and flexible arity function symbols and patterns is described. The procedure enumerates a set of substitution/constraint pairs which constitutes the minimal complete set of unifiers.
متن کاملUnification Procedure for Terms with Sequence Variables and Sequence Functions
We study term equations with sequence variables and sequence function symbols. A sequence variable can be instantiated by any finite sequence of terms, including the empty sequence. A sequence function abbreviates a finite sequence of functions all having the same argument lists. An instance of such a function is IntegerDivision(x,y) that abbreviates the sequence Quotient(x, y),Remainder(x, y)....
متن کاملNew Results on Arity vs. Number of Variables New Results on Arity vs. Number of Variables
Résumé In this paper, definability in existential second-order logic is considered. Our main goal it to study the relationships between the arity of second-order quantified (i.e. guessed) symbols and the number of first-order universal variables in formulas. The key idea behind this work is that bounding the arity of guessed symbols strongly limits the number of first-order universally quantifi...
متن کامل